Decoupled Delay and Rate Guarantees for Cross Domain Thread Scheduling

نویسندگان

  • David K.Y. Yau
  • David K. Y. Yau
چکیده

CPU scheduling for multimedia applications has received a lot of recent mtention. While previous fair share schedulers are able to provide real-lime perfonnance guarantees, they do not consider application priority in their scheduling decisions. An important consequence is that delay and rate guarantees are coupled together, so that low delay cannot be achieved simultaneously with low rate. In this paper, we discuss CPU scheduling with decQupled delay and rate guaramees, and its application across operating system protection domains. OUf work makes three significant contributions. First, by extending a basic scheduling algorithm with provable fair throughput, we present two practical algorithms with decoupled delay and rate perfonnance in a CPU context. Second, we define a train abstraction that seamlessly extends thread level perfonnance guarantees to cross-domain computation. Third, extensive experimental results from a prototype implementation in Solaris 2.5.1 demonstrate the perfonnance of our approach in a real system environment.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the allocation of network service curves for bandwidth/delay-decoupled scheduling disciplines

been and still is an important research area. In particular, it is important to ensure strict (deterministic) guarantees for highly time-sensitive data flows. In this paper, we discuss how to efficiently allocate service curves for deter-ministically guaranteed services. We focus on bandwidth/ delay-decoupled service disciplines and their respective service curves due to their distinct advantag...

متن کامل

[Proceeding] Decoupling Bandwidth and Delay Properties in Class Based Queuing

This paper presents the Decoupled Class Based Scheduling, a CBQ-derived scheduling algorithm. Main advantages of D-CBQ are a new set of rules for distributing excess bandwidth and the ability to guarantee bandwidth and delay in a separate way, whence the name “decoupled”; moreover D-CBQ guarantees better delay bounds and more precise bandwidth assignment. This paper presents D-CBQ main points a...

متن کامل

Decoupling Bandwidth and Delay Properties in Class Based Queuing

This paper presents the Decoupled Class Based Scheduling, a CBQ-derived scheduling algorithm. Main advantages of D-CBQ are a new set of rules for distributing excess bandwidth and the ability to guarantee bandwidth and delay in a separate way, whence the name “decoupled”; moreover D-CBQ guarantees better delay bounds and more precise bandwidth assignment. This paper presents D-CBQ main points a...

متن کامل

Efficient fair queuing with decoupled delay-bandwidth guarantees

In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on an existing efficient fair scheduler, Frame-based Fair Queueing (FFQ)[1], and therefore inherits the fairness, simplicity and efficiency of that policy. We combine a slightly modified version of an FFQ scheduler with the link sharing concept using rate estimator modu...

متن کامل

Optimal Network Service Curves under Bandwidth-Delay Decoupling Author:

Providing Quality of Service (QoS) guarantees to data flows in packet-switched networks like the Internet has been and still is an important research area. In particular, it is important to ensure strict (deterministic) guarantees for highly time-sensitive data flows. In this work, we derive optimal network service curves for deterministic service flows which are scheduled by bandwidth-delay de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998